public class Solution1359 {
    public int countOrders(int n) {
        long t=1;
        int mod=1000000007;
        for (int i=2;i<=n;i++){
            t=(t*i)%mod*(2*i-1)%mod;
        }
        return (int)t;
    }

    public static void main(String[] args) {
        System.out.println(new Solution1359().countOrders(3));
    }
}
